a=[3 5 6 4 2 7 9 8 1 0]
len = 10
%[a,len]=heap_sort(a,len)
Qb=PriorityQueue_Create(a,len)
[Qc,lenc] = PriorityQueue_Add(Qb,len,9)
[qc,len]= heap_sort(Qc,lenc)

[Qd,lend,ret] = PriorityQueue_Delete(Qc,lenc);
Qd
for n=lenc-1:-1:1
[Qd,lend,ret] = PriorityQueue_Delete(Qd,n);
Qd
end